翻訳と辞書 Words near each other ・ Bindeshwari Goyal ・ Bindeshwari Prasad ・ Bindeshwari Prasad Sinha ・ Bindeshwari Prasad Verma ・ Bindfelde station ・ Bindha railway station ・ Binary star ・ Binary Star (hip hop group) ・ Binary stars in fiction ・ Binary symmetric channel ・ Binary Synchronous Communications ・ Binary system ・ Binary system (disambiguation) ・ Binary tetrahedral group ・ Binary translation ・ Binary tree ・ Binary vector ・ Binary XML ・ Binary-coded decimal ・ Binary-safe ・ Binary-to-text encoding ・ BINAS ・ Binas ・ Binasal hemianopsia ・ Binasal occlusion ・ Binasco ・ Binasli ・ Binasuan ・ Binat Bibi Mosque ・ Binatape Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Binary tree ： ウィキペディア英語版 Binary tree In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the ''left'' child and the ''right'' child. A recursive definition using just set theory notions is that a (non-empty) binary tree is a triple (''L'', ''S'', ''R''), where ''L'' and ''R'' are binary trees or the empty set and ''S'' is a singleton set. Some authors allow the binary tree to be the empty set as well. From a graph theory perspective, binary (and K-ary) trees as defined here are actually arborescences. A binary tree may thus be also called a bifurcating arborescence〔—a term which actually appears in some very old programming books, before the modern computer science terminology prevailed. It is also possible to interpret a binary tree as an undirected, rather than a directed graph, in which case a binary tree is an ordered, rooted tree. Some authors use rooted binary tree instead of ''binary tree'' to emphasize the fact that the tree is rooted, but as defined above, a binary tree is always rooted. A binary tree is a special case of an ordered K-ary tree, where ''k'' is 2. In computing, binary trees are seldom used solely for their structure. Much more typical is to define a labeling function on the nodes, which associates some value to each node. Binary trees labelled this way are used to implement binary search trees and binary heaps, and are used for efficient searching and sorting. The designation of non-root nodes as left or right child even when there is only one child present matters in some of these applications, in particular it is significant in binary search trees. In mathematics, what is termed ''binary tree'' can vary significantly from author to author. Some use the definition commonly used in computer science,〔 but others define it as every non-leaf having exactly two children and don't necessarily order (as left/right) the children either. == Definitions == 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Binary tree」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.